Maze Routing with Bu er Insertion and Wiresizing

We propose an elegant formulation of the Maze Routing with Bu er Insertion and Wiresizing pr oblem as a graph-the oretic shortest path problem. This formulation provides time and space performance improvements over previously proposed dynamic-programming based techniques. R outing c onstr aints such as wiring obstacles and restrictions on bu er locations and types are easily incorporated in the formulation. Furthermore, e cient softwar eroutines solving shortest path problems in existing graph applic ation libraries can be applied. We construct a BP-Graph such that the length of every path in this graph is e qual to the Elmore delay. Therefore, nding the minimum Elmore delay path becomes a nite shortest path problem. The bu er choices and insertion locations are represente d as the vertices in the BP-Graph. The interconnect wir es are sized by constructing a look-up table for bu er-to-bu er wir esizing solutions. We also provide a technique that is able to tremendously improve the runtime. Experiments show improvements over previously proposed methods.